On the stable model semantics for intensional functions
نویسندگان
چکیده
Several extensions of the stable model semantics are available to describe “intensional” functions—functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited for alleviating the grounding bottleneck involving functional fluents. However, the extensions were defined in different ways under different intuitions. In this paper we provide several reformulations of the extensions, and note that they are in fact closely related to each other and coincide on large syntactic classes of logic programs.
منابع مشابه
Stable Models of Formulas with Intensional Functions
In classical logic, nonBoolean fluents, such as the location of an object and the color of a ball, can be naturally described by functions, but this is not the case with the traditional stable model semantics, where the values of functions are predefined, and nonmonotonicity of the semantics is related to minimizing the extents of predicates but has nothing to do with functions. We extend the f...
متن کاملLogic Programs with Intensional Functions
The stable model semantics treats a logic program as a mechanism for specifying its intensional predicates. In this paper we discuss a modification of that semantics in which functions, rather than predicates, are intensional. The idea of the new definition comes from nonmonotonic causal logic.
متن کاملLogic Programs with Intensional Functions (Preliminary Report)
The stable model semantics treats a logic program as a mechanism for specifying its intensional predicates. In this note we discuss a modification of that semantics in which functions, rather than predicates, are intensional. The idea of the new definition comes from nonmonotonic causal logic.
متن کاملStable Models of Multi-Valued Formulas: Partial vs. Total Functions
Recent extensions of the stable model semantics that allow intensional functions—functions that can be specified by logic programs using other functions and predicates—can be divided into two groups. One group defines a stable model in terms of minimality on the values of partial functions, and the other defines it in terms of uniqueness on the values of total functions. We show that, in the co...
متن کاملStable Models of Multi-Valued Formulas: Partial versus Total Functions
Recent extensions of the stable model semantics that allow intensional functions—functions that can be specified by logic programs using other functions and predicates—can be divided into two groups. One group defines a stable model in terms of minimality on the values of partial functions, and the other defines it in terms of uniqueness on the values of total functions. We show that, in the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- TPLP
دوره 13 شماره
صفحات -
تاریخ انتشار 2013